#include <iostream>
#include <string>
#include "AVLTree.h"
using namespace std;

int main()
{
    AVLTree<int,int> tree;
    int a[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };
    int len = sizeof(a) / sizeof(a[0]);
    for (int i = 0; i < len; i++)
    {
        tree.insert(make_pair(a[i],i));
    }
    tree.InOrder();
    cout << "isHeight:" << tree.Height() << endl;
    cout << "isBalance:" << tree.Balance() << endl;
    return 0;
}